Describing and Measuring the Complexity of SAT encodings for Constraint Programs
نویسندگان
چکیده
The CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositional logic that is handed to an external SAT solver. We investigate the problem of predicting the size of formulas produced by the CO4 compiler. The goal is to help the programmer in understanding the resource consumption of CO4 on his program. We present a basic cost model, with some experimental data, and discuss ongoing work towards static analysis. It turns out that analysis steps will use constraint systems as well.
منابع مشابه
Solving Many-Valued SAT Encodings with Local Search
In this paper we present MV-SAT, which is a many-valued constraint programming language that bridges the gap between Boolean Satisfiability and Constraint Satisfaction. Our overall goal is to extend the SAT formalism with many-valued sets and deal with more compact and natural encodings, as in CSP approaches, while retaining the efficiencies of SAT solvers operating on uniform encodings. After ...
متن کاملLocal Search on SAT-encoded Colouring Problems
Constraint satisfaction problems can be SAT-encoded in more than one way, and the choice of encoding can be as important as the choice of search algorithm. Theoretical results are few but experimental comparisons have been made between encodings, using both local and backtrack search algorithms. This paper compares local search performance on seven encodings of graph colouring benchmarks. Two o...
متن کاملExploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT
Encoding to SAT and applying a highly efficient modern SAT solver is an increasingly popular method of solving finite-domain constraint problems. In this paper we study encodings of arbitrary constraints where unit propagation on the encoding provides strong reasoning. Specifically, unit propagation on the encoding simulates generalised arc consistency on the original constraint. To create comp...
متن کاملTwo-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison
Logic programming with the stable model semantics has been proposed as a constraint programming paradigm for solving constraint satisfaction and other combinatorial problems. In such a language one writes function-free logic programs with negation. Such a program is instantiated to a ground program from which the stable models are computed. In this paper, we identify a class of logic programs f...
متن کاملTo Encode or to Propagate? The Best Choice for Each Constraint in SAT
Sophisticated compact SAT encodings exist for many types of constraints. Alternatively, for instances with many (or large) constraints, the SAT solver can also be extended with built-in propagators (the SAT Modulo Theories approach, SMT). For example, given a cardinality constraint x1+ . . .+xn ≤ k, as soon as k variables become true, such a propagator can set the remaining variables to false, ...
متن کامل